Matched Drawings of Planar Graphs
نویسندگان
چکیده
A natural way to draw two planar graphs whose vertex sets are matched is to assign each matched pair a unique y-coordinate. In this paper we introduce the concept of such matched drawings, which are a relaxation of simultaneous geometric embeddings with mapping. We study which classes of graphs allow matched drawings and show that (i) two 3-connected planar graphs or a 3-connected planar graph and a tree may not be matched drawable, while (ii) two trees or a planar graph and a planar graph of some special families—such as unlabeled level planar (ULP) graphs or the family of “carousel graphs”—are always matched drawable.
منابع مشابه
Planar Lombardi Drawings of Outerpaths
A Lombardi drawing of a graph is a drawing where edges are represented by circular arcs that meet at each vertex v with perfect angular resolution 360◦/deg(v) [3]. It is known that Lombardi drawings do not always exist, and in particular, that planar Lombardi drawings of planar graphs do not always exist [1], even when the embedding is not fixed. Existence of planar Lombardi drawings is known f...
متن کاملDrawing some planar graphs with integer edge-lengths
In this paper, we study drawings of planar graphs such that all edge lengths are integers. It was known that such drawings exist for all planar graphs with maximum degree 3. We give a different proof of this result, which is based on a simple transformation of hexagonal drawings as created by Kant. Moreover, if the graph is 3-connected then the vertices have integer coordinates that are in O(n)...
متن کاملPlanar Drawings and Angular Resolution: Algorithms and Bounds (Extended Abstract)
We investigate the problem of constructing planar straight-line drawings of graphs with large angles between the edges. Namely, we study the angular resolution of planar straight-line drawings, deened as the smallest angle formed by two incident edges. We prove the rst nontrivial upper bound on the angular resolution of planar straight-line drawings, and show a continuous trade-oo between the a...
متن کاملDrawing Planar Graphs with Prescribed Face Areas
This thesis deals with planar drawings of planar graphs such that each interior face has a prescribed area. Our work is divided into two main sections. The first one deals with straight-line drawings and the second one with orthogonal drawings. For straight-line drawings, it was known that such drawings exist for all planar graphs with maximum degree 3. We show here that such drawings exist for...
متن کاملGraph Drawings with One Bend and Few Slopes
We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of these paths is small. We prove that d 2 e edge slopes suffice for outerplanar drawings of outerplanar graphs with maximum degree ∆ > 3. This matches the obvious lower bound. We also show that d 2 e + 1 edge slopes suffice ...
متن کامل